Universality of Random Graphs for Graphs of Maximum Degree Two
نویسندگان
چکیده
منابع مشابه
The maximum degree of random planar graphs
McDiarmid and Reed [‘On the maximum degree of a random planar graph’, Combin. Probab. Comput. 17 (2008) 591–601] showed that the maximum degree Δn of a random labeled planar graph with n vertices satisfies with high probability (w.h.p.) c1 logn < Δn < c2 logn, for suitable constants 0 < c1 < c2. In this paper, we determine the precise asymptotics, showing in particular that w.h.p. |Δn − c logn|...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملEmbedding Arbitrary Graphs of Maximum Degree Two
Let S(H) be the minimum degree of the graph H. We prove that a graph H of order n with S(H) ^ (2n —1)/3 contains any graph G of order at most n and maximum degree A(G) < 2 as a subgraph, and this bound is best possible. Furthermore, this result settles the case A(G) = 2 of the well-known conjecture of Bollobas, Catlin and Eldridge on packing two graphs with given maximum degree.
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملColoring graphs of various maximum degree from random lists
Let G = G(n) be a graph on n vertices with maximum degree ∆ = ∆(n). Assign to each vertex v of G a list L(v) of colors by choosing each list independently and uniformly at random from all k-subsets of a color set C of size σ = σ(n). Such a list assignment is called a random (k, C)-list assignment. In this paper, we are interested in determining the asymptotic probability (as n → ∞) of the exist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2014
ISSN: 0895-4801,1095-7146
DOI: 10.1137/130942437